The vehicle routing problem with relaxed priority rules

The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among numerous variants VRP, this research addresses VRP with relaxed priority rules (VRP-RPR) which customers are assigned to several groups and highest priorities typically need be served before lower ones. Additional used control trade-off between cost efficiency. We propose a Mixed Integer Linear Programming (MILP) model formulate problem solve small-sized instances. A metaheuristic based on Adaptive Large Neighborhood Search (ALNS) algorithm problem-tailored components then designed handle at larger scales. experimental results demonstrate performance our proposed algorithm. Remarkably, it outperforms recently Clustered Traveling Saleman d-relaxed rule (CTSP-d), special case VRP-RPR, both solution quality computational time.